Efficient consensus algorithm for the accurate faulty node tracking with faster convergence rate in a distributed sensor network

This article was published in the Eurasip Journal on Wireless Communications and Networking [©2016 Published by Springer International Publishing.] and the definite version is available at: http://dx.doi.org/10.1186/s13638-016-0698-x . The article website is at:http://jwcn.eurasipjournals.springeropen.com/articles/10.1186/s13638-016-0698-xOne of the challenging issues in a distributed computing system is to reach on a decision with the presence of so many faulty nodes. These faulty nodes may update the wrong information, provide misleading results and may be nodes with the depleted battery power. Consensus algorithms help to reach on a decision even with the faulty nodes. Every correct node decides some values by a consensus algorithm. If all correct nodes propose the same value, then all the nodes decide on that. Every correct node must agree on the same value. Faulty nodes do not reach on the decision that correct nodes agreed on. Binary consensus algorithm and average consensus algorithm are the most widely used consensus algorithm in a distributed system. We apply binary consensus and average consensus algorithm in a distributed sensor network with the presence of some faulty nodes. We evaluate these algorithms for better convergence rate and error rate. © 2016, The Author(s).Publishe

Cooperative game theory based load balancing in long term evolution network

This conference paper was presented in the 1st International Conference on Computer and Information Engineering, ICCIE 2015; Department of Computer Science and Engineering (CSE) of Rajshahi University of Engineering and Technology (RUET)Rajshahi; Bangladesh; 26 November 2015 through 27 November 2015 [© 2015 Institute of Electrical and Electronics Engineers Inc.] The conference paper's definite version is available at: http://10.1109/CCIE.2015.7399302Long term evolution (LTE) network, incompatible with 2G and 3G networks is the most promising technology for wireless communication with higher speed and capacity. Self-organized load balancing is an important research issue for the wireless networks. Game theory provides an efficient way to provide self-organizing properties in a distributed environment like LTE networks. Load balancing means to assign users from highly loaded cells to neighbor lower loaded cells. The amount of load needs to be offloaded or accepted by a particular cell is not really specified and currently totally vendor specified. In our proposed cooperative game theoretic approach, each cell is considered as a player where they trade the load by forming a coalition by satisfying the overall performance of the network. Simulation results show that our proposed method provides better performance in terms of satisfied users and adjusted load values